Characterizing Graphs with Convex and Connected Cayley Configuration Spaces
نویسندگان
چکیده
منابع مشابه
Characterizing graphs with convex and connected configuration spaces
We define and study exact, efficient representations of realization spaces Euclidean Distance Constraint Systems (EDCS). These are graphs with distance assignments on the edges (frameworks) or graphs with distance interval assignments on the edges. Each representation corresponds to a choice of non-edges or Cayley parameters. The set of realizable distance assignments to the chosen parameters y...
متن کاملHamilton-Connected Cayley Graphs on Hamiltonian Groups
We refer to the preceding theorem as the Chen–Quimpo theorem throughout the paper. Are there other families of groups which admit analogues of the Chen–Quimpo theorem? A natural direction in which to look is towards groups that are, in some sense, ‘almost’ abelian. The dihedral groups have been investigated [2]. Another family of groups, and the subject of this paper, is the family of Hamiltoni...
متن کاملAutomorphism groups of Cayley graphs generated by connected transposition sets
Let S be a set of transpositions that generates the symmetric group Sn, where n ≥ 3. The transposition graph T (S) is defined to be the graph with vertex set {1, . . . , n} and with vertices i and j being adjacent in T (S) whenever (i, j) ∈ S. We prove that if the girth of the transposition graph T (S) is at least 5, then the automorphism group of the Cayley graph Cay(Sn, S) is the semidirect p...
متن کاملCayley graphs - Cayley nets
It is, however, not clear how to choose the generators to produce special graphs. We know many topologies and their generators, but many more may be constructed in the future, having better properties (in terms of diameter, nodal degree and connectivity) than for instance the hypercube. I will present several graphs which connect rings using the generator g 1 and some additional generators.
متن کاملConvex Partitions with 2-Edge Connected Dual Graphs
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into open convex cells whose dual graph (defined below) is 2-edge connected. Intuitively, every edge of the dual graph corresponds to a pair of adjacent cells that are both incident to the same vertex. Aichholzer et al. rec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2009
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-009-9160-8